Engineering the Prover Interface
نویسنده
چکیده
Practical prover interfaces are sizeable pieces of software, whose construction and maintenance requires an extensive amount of effort and resources. This paper addresses the engineering aspects of such developments. Using non-functional properties as quality attributes for software, we discuss which properties are particularly relevant to prover interfaces and demonstrate, by the example of the IP interface for Isabelle, how judicious architectural and design decisions lead to an interface software possessing these properties. By a comparison with other proposed interfaces, we argue that our considerations can be applied beyond the example project.
منابع مشابه
E - a brainiac theorem prover
We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality. Important properties of the prover include strong redundancy elimination criteria, the DISCOUNT loop proof procedure, a very flexible interface for specifying search control heuristics, and an efficient inference engine. We also discuss strength and weaknesses of t...
متن کاملA WWW Interface to a Theorem Prover for Modal Logic
This paper describes a WWW interface to a theorem prover for normal modal logics for client-server transactions. The server includes the implementation of the theorem prover, which is based on KE and a generalization of Fitting's preexed tableaux, and a front-end which uses a library for implementing brokered inter-process communication over the internet. The front-end enables electronic client...
متن کاملKnowledge Engineering for Large Ontologies with Sigma KEE 3.0
The Suggested Upper Merged Ontology (SUMO) is a large, comprehensive ontology stated in higher-order logic. It has co-evolved with a development environment called the Sigma Knowledge Engineering Environment (SigmaKEE). A large and important subset of SUMO can be expressed in first-order logic with equality. SigmaKEE has integrated different reasoning systems multiple queries to the same theory...
متن کاملThe KeY system 1.0 (Deduction Component)
The KeY system is a development of the ongoing KeY project, whose aim is to integrate formal specification and deductive verification into the industrial software engineering processes. The deductive component of the KeY system is a novel interactive/automated prover for first-order Dynamic Logic for Java. The KeY prover features a userfriendly graphical interface, a backtracking-free free-vari...
متن کاملSystem description: CondLean
In this paper we present a theorem prover called CondLean for normal propositional conditional logics CK, CK+ID, CK+MP and CK+MP+ID. The theorem prover implements some sequent calculi for these logics recently introduced. The theorem prover is delveloped following the methodology of Lean-TAP and it is implemented in SICStus Prolog. The theorem prover also comprises a graphical user interface im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 285 شماره
صفحات -
تاریخ انتشار 2012